Garbage Collection in the Larchant Persistent Distributed Shared Store
نویسندگان
چکیده
We study tracing garbage collection (GC) for a distributed shared memory (DSM) in order to provide persistence by reachability (PBR), in a large-scale distributed system. Within a general model of DSM, we specify a distributed tracing GC algorithm that scales, collects cycles, and is orthogonal to coherence. Its main features are: (i) piecewise collection of opportunistically-chosen subsets of the memory, (ii) each site collects independently of other sites, (iii) data replicas are collected independently and no coherence operation is needed for GC purposes; and (iv) asyn-chrony of collection with respect to applications.
منابع مشابه
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and of locks, collecting objects unreachable from the persistent root, writing reachable objects to disk, and reducing store fragmentation. Memory management is based on a novel garbage collection algorithm, that approxima...
متن کاملUser Level Library User Level Library User Level disk
We describe the PerDiS persistent distributed store and its garbage collection algorithm. The PerDiS store behaves like an object-oriented persistent shared memory, and is accessed transactionally. Applications get direct access to persistent data in their own memory, and use the usual C/C++ pointer dereferencing and assignment to navigate and modify the object graph. PerDiS provides persistenc...
متن کاملLarchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a general model for DSM+PBR, we specify a distributed GC algorithm that is efficient and scalable. Its main features are: (i) independent collection...
متن کاملPerdis { a Persistent Distributed Store for Cooperative Applications
The PerDiS platform deploys a novel technology for the distributed sharing of information: a persistent distributed store, which provides a shared memory abstraction which is tranparently made persistent thanks to distributed garbage collection. This data sharing platform supports interactive concurrent engineering applications in a virtual enterprise. In this paper we give an overview of the p...
متن کاملGarbage Collecting Persistent Object Stores
Many techniques have been devised for garbage collecting main memory heaps for programming languages, and there has more recently been progress on distributed garbage collection, for sets of long-lived processes in distributed systems. Little attention has been paid to garbage collecting large persistent stores, however. A persistent store is essentially a shared heap that outlives the executio...
متن کامل